Parallel evaluation of datalog programs by load sharing

Parallel Bottom-up Evaluation of Datalog Progrm~ by Load Sharing Parallel Boitom·up Evaluanon of Datalog Programs by Load Sharing

We propose a method of parallelizing bottom-up-evaluation of logic programs. The method is distinguished by the fact that it is pUTe i.e., does not require interprocessor communication, or synchronization overhead. The method cannot be used to parallelize every logic progtam, but we syntactically characterize several classes of logic programs to which the method can be applied (e.g., the class ...

Refinement of Datalog Programs

Refinement operators are exploited to change in an automated way incorrect clauses of a logic program. In this paper, we present four refinement operators for Datalog programs and demonstrate that all of them meet the properties of local finiteness, properness, and completeness (ideality). Such operators are based on the quasi-ordering induced upon a set of clauses by the generalization model o...

Chain Queries Expressible by Linear Datalog Programs

Load Sharing with Parallel Priority Queues

For maximum efficiency in a multiprocessor system the load should be shared evenly over all processors, that is, there should be no idle processors when tasks are available. The delay in a load sharing algorithm is the larger of the maximum time that any processor can be idle before a task is assigned to it, and the maximum time that it must wait to be relieved of an excess task. A simple paral...

evaluation of fat atrophy in patients with dermis fat graft of orbit by ct-scan

چکیده ندارد.